Enhanced Multilevel Hybrid Algorithm for Graph Partitioning

Multilevel Graph Partitioning Schemes

In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph. We investigate the effectiveness of many different choices for all three phases: coarsening, partition of the coarsest graph, and refinement. In p...

Parallel Multilevel Graph Partitioning

In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm achieves a speedup of up to 56 on a 128-processorCray T3D for moderate size problems, further reducing its already moderate serial run time. Graphs with over 200,000 vertices can be partitioned in 128 p...

A Hybrid Genetic Algorithm for Multiway Graph Partitioning

A hybrid genetic algorithm for multiway graph partitioning is proposed. The algorithm includes an e cient local optimization heuristic. Starting at an initial solution, the heuristic iteratively improves the solution using cyclic movements of vertices. The suggested heuristic performed well in itself and as a local optimization engine in the hybrid genetic algorithm. Combined with the framework...

Engineering Multilevel Graph Partitioning Algorithms

We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from multigrid linear solvers. Local improvement algorithms are based on max-flow min-cut computations and more localized FM searches. By combining these techniques, we obtain an algorithm that is fast on the one hand and on the other hand is able to improve th...

Analytical Methods for Multilevel Graph-Partitioning